Evaluation of credit risk based on firm performance.

Efficient Markov Network Discovery Using Particle Filters.

Efficient Markov Network Structure Discovery Using Independence Tests.
We present two algorithms for learning the structure of a Markov network from discrete data: GSMN and GSIMN. Both algorithms use statistical conditional independence tests on data to infer the structure by successively constraining the set of structures consistent with the results of these tests. GSMN is a natural adaptation of the Grow-Shrink algorithm of Margaritis and Thrun for learning the structure of Bayesian networks. GSIMN extends GSMN by additionally exploiting Pearl’s well-known properties of conditional independence relations to infer novel independencies from known independencies, thus avoiding the need to perform these tests. Experiments on artificial and real data sets show GSIMN can yield savings of up to 70 % with respect to GSMN, while generating a Markov network with comparable or in several cases considerably improved quality. In addition
Improving the Reliability of Causal Discovery from Small Data Sets Using Argumentation.
We address the problem of improving the reliability of independence-based causal discovery algorithms that results from the execution of statistical independence tests on small data sets, which typically have low reliability. We model the problem as a knowledge base containing a set of independence facts that are related through Pearl’s well-known axioms. Statistical tests on finite data sets may result in errors in these tests and inconsistencies in the knowledge base. We resolve these inconsistencies through the use of an instance of the class of defeasible logics called argumentation, augmented with a preference function, that is used to reason about and possibly correct errors in these tests. This results in a more robust conditional independence test, called an argumentative independence test. Our experimental evaluation shows clear positive improvements in the accuracy of argumentative over purely statistical tests. We also demonstrate significant improvements on the accuracy of causal structure discovery from the outcomes of independence tests both on sampled data from randomly generated causal models and on real-world data sets.
Learning Markov Network Structure using Few Independence Tests.
In this paper we present the Dynamic Grow-Shrink Inference-based Markov network learning algorithm (abbreviated DGSIMN), which improves on GSIMN, the state-ofthe-art algorithm for learning the structure of the Markov network of a domain from independence tests on data. DGSIMN, like other independence-based algorithms, works by conducting a series of statistical conditional independence tests toward the goal of restricting the number of possible structures to one, thus inferring that structure as the only possibly correct one. During this process, DGSIMN, like the GSIMN algorithm, uses the axioms that govern the probabilistic independence relation to avoid unnecessary tests i.e., tests that can be inferred from the results of known ones. This results in both efficiency and reliability advantages over the simple application of statistical tests. However, one weakness of GSIMN is its rigid and heuristic ordering of the execution of tests, which results in potentially inefficient execution. DGSIMN instead uses a principled strategy, dynamically selecting the locally optimal test that is expected to increase the state of our knowledge about the structure the most. This is done by calculating the expected number of independence facts that will become known (through inference) after executing a particular test (before it is actually evaluated on data), and by selecting the one that is expected to maximize the number of such inferences, thus avoiding their potentially expensive evaluation on data. As we demonstrate in our experiments, this results in an overall decrease in the computational requirements of the algorithm, sometimes dramatically, due to the decreased the number of tests required to be evaluated on data. Experiments show that DGSIMN yields savings of up to 88 % on both sampled and benchmark data while achieving similar or better accuracy in most cases. 1
Efficient and Robust Independence%2DBased Markov Network Structure Discovery.

Efficient Markov Network Structure Discovery using Independence Tests.
We present two algorithms for learning the structure of a Markov network from discrete data: GSMN and GSIMN. Both algorithms use statistical conditional independence tests on data to infer the structure by successively constraining the set of structures consistent with the results of these tests. GSMN is a natural adaptation of the Grow-Shrink algorithm of Margaritis and Thrun for learning the structure of Bayesian networks. GSIMN extends GSMN by additionally exploiting Pearl’s well-known properties of conditional independence relations to infer novel independencies from known independencies, thus avoiding the need to perform these tests. Experiments on artificial and real data sets show GSIMN can yield savings of up to 70 % with respect to GSMN, while generating a Markov network with comparable or in several cases considerably improved quality. In addition
Distribution%2DFree Learning of Bayesian Network Structure in Continuous Domains.
In this paper we present a method for learning the structure  of Bayesian networks (BNs) without making any assumptions  on the probability distribution of the domain. This is mainly  useful for continuous domains, where there is little guidance  and many choices for the parametric distribution families to  be used for the local conditional probabilities of the Bayesian  network, and only a few have been examined analytically. We  therefore focus on BN structure learning in continuous domains.
Speculative Markov Blanket Discovery for Optimal Feature Selection.
In this paper we address the problem of learning the Markov blanket of a quantity from data in an efficient manner. Markov blanket discovery can be used in the feature selection problem to find an optimal set of features for classification tasks, and is a frequently-used preprocessing phase in data mining, especially for high-dimensional domains. Our contribution is a novel algorithm for the induction of Markov blankets from data, called Fast-IAMB, that employs a heuristic to quickly recover the Markov blanket. Empirical results show that Fast-IAMB performs in many cases faster and more reliably than existing algorithms without adversely affecting the accuracy of the recovered Markov blankets. 1.
Essential Hidden Variables An Exploratory Algorithm.

A Bayesian Multiresolution Independence Test for Continuous Variables.
In this paper we present a method of computing the posterior probability of conditional independence of two or more continuous variables from data, examined at several resolutions. Our approach is motivated by the observation that the appearance of continuous data varies widely at various resolutions, producing very different independence estimates between the variables involved. Therefore, it is difficult to ascertain independence without examining data at several carefully selected resolutions. In our paper, we accomplish this using the exact computation of the posterior probability of independence, calculated analytically given a resolution. At each examined resolution, we assume a multinomial distribution with Dirichlet priors for the discretized table parameters, and compute the posterior using Bayesian integration. Across resolutions, we use a search procedure to approximate the Bayesian integral of probability over an exponential number of possible histograms. Our method generalizes to an arbitrary number variables in a straightforward manner. The test is suitable for Bayesian network learning algorithms that use independence tests to infer the network structure, in domains that contain any mix of continuous, ordinal and categorical variables. 1
NetCube A Scalable Tool for Fast Data Mining and Compression.
We propose an novel method of computing and storing DataCubes. Our idea is to use Bayesian Networks, which can generate approximate counts for any query combination of attribute values and &#034;don&#039;t cares.&#034; A Bayesian network represents the underlying joint probability distribution of the data that were used to generate it. By means of such a network the proposed method, NetCube, exploits correlations among attributes. Our proposed preprocessing algorithm scales linearly on the size of the database, and is thus scalable; it is also parallelizable with a straightforward parallel implementation. Moreover, we give an algorithm to estimate counts of arbitrary queries that is fast (constant on the database size). Experimental results show that NetCubes have fast generation and use (a few minutes preprocessing time per 100,000 records and less than a second query time), achieve excellent compression (at least 1800:1 compression ratios on real data) and have low reconstruction error (less than 5% on average). Moreover, our method naturally allows for visualization and data mining, at no extra cost.  Keywords: DataCube approximation, count query, Bayesian network, Bayesian network structure learning, machine learning.  1 The Problem  The problem of computing counts of records with desired characteristics from a database is a very common one in the area of decision support systems and data mining. A typical scenario is as follows: a customer analyst wants to discover groups of customers that exhibit an interesting or unusual behavior that might lead to possibly profitable insights into the company&#039;s customer behavior. In other words, a company wants to be able to model its customer base well, and the better it is able to do that, the more insights it can obtain from the model and m...
Regions%2Dof%2DInterest and Spatial Layout for Content%2DBased Image Retrieval.
To date most &#034;content-based image retrieval&#034; (CBIR) techniques rely on global attributes such as color or texture histograms which tend to ignore the spatial composition of the image. In this paper, we present an alternative image retrieval system based on the principle that it is the user who is most qualified to specify the query &#034;content&#034; and not the computer. With our system, the user can select multiple &#034;regions-of-interest&#034; and can specify the relevance of their spatial layout in the retrieval process. We also derive similarity bounds on histogram distances for pruning the database search. This experimental system was found to be superior to global indexing techniques as measured by statistical sampling of multiple users&#039; &#034;satisfaction&#034; ratings.
Regions%2Dof%2DInterest and Spatial Layout for Content%2DBased Image Retrieval.
To date most &#034;content-based image retrieval&#034; (CBIR) techniques rely on global attributes such as color or texture histograms which tend to ignore the spatial composition of the image. In this paper, we present an alternative image retrieval system based on the principle that it is the user who is most qualified to specify the query &#034;content&#034; and not the computer. With our system, the user can select multiple &#034;regions-of-interest&#034; and can specify the relevance of their spatial layout in the retrieval process. We also derive similarity bounds on histogram distances for pruning the database search. This experimental system was found to be superior to global indexing techniques as measured by statistical sampling of multiple users&#039; &#034;satisfaction&#034; ratings.
Image Retrieval with Local and Spatial Queries.
To date most &#034;content-based image retrieval&#034; (CBIR) techniques rely on global attributes such as color or texture histograms which unfortunately ignore the spatial composition of the image. In this paper, we present an alternative image retrieval system based on the principle that it is the user who is most qualified to specify the query &#034;content&#034; and not the computer. With our system, the user can select multiple &#034;regionsof -interest&#034; and can specify the relevance of their spatial layout in the retrieval process. We also derive similarity bounds on histogram distances and use them to prune the database search. This experimental system was found to be superior to global indexing techniques as measured by statistical sampling of multiple users&#039; &#034;satisfaction&#034; ratings. 1
Bayesian Network Induction via Local Neighborhoods.
In recent years, Bayesian networks have become highly successful tool for diagnosis,  analysis, and decision making in real-world domains. We present an  efficient algorithm for learning Bayes networks from data. Our approach constructs  Bayesian networks by first identifying each node&#039;s Markov blankets, then  connecting nodes in a maximally consistent way. In contrast to the majority of  work, which typically uses hill-climbing approaches that may produce dense and  causally incorrect nets, our approach yields much more compact causal networks  by heeding independencies in the data. Compact causal networks facilitate fast inference  and are also easier to understand. We prove that under mild assumptions,  our approach requires time polynomial in the size of the data and the number of  nodes. A randomized variant, also presented here, yields comparable results at  much higher speeds.  1 Introduction  A great number of scientific fields today benefit from being able to automatically est...
Template%2DBased Recognition of Pose and Motion Gestures On a Mobile Robot.
For mobile robots to assist people in everyday life, they must be easy to instruct. This paper describes a gesture-based interface for human robot interaction, which enables people to instruct robots through easy-to-perform arm gestures. Such gestures might be static pose gestures, which involve only a specific configuration of the person&#039;s arm, or they might be dynamic motion gestures (such as waving). Gestures are recognized in real-time at approximate frame rate, using a hybrid approach that integrates neural networks and template matching. A fast, color-based tracking algorithm enables the robot to track and follow a person reliably through office environments with drastically changing lighting conditions. Results are reported in the context of an interactive clean-up task, where a person guides the robot to specific locations that need to be cleaned, and the robot picks up trash which it then delivers to the nearest trash-bin. Introduction  The field of robotics is currently under...
Learning to Locate an Object in 3D Space from a Sequence of Camera Images.
This paper addresses the problem of determining an object&#039;s 3D location from a stream of camera images recorded by mobile robot. The approach presented here allows people to &#034;train&#034; robots to recognize specific objects, by presenting it examples of the object to be recognized. A decision tree method is used to learn significant features of the target object from individual camera images. Individual estimates are integrated over time using Bayes rule, into a probabilistic 3D model of the robot&#039;s environment. Experimental results illustrate that the method enables a mobile robot to robustly estimate the 3D location of objects from multiple camera images.  Keywords: Mobile Robotics, Decision Trees, Probabilistic Reasoning. Contact author: Dimitris Margaritis office: (412) 268--6767 lab: (412) 268--3837  1 Introduction  In recent years, there has been significant progress in the field of mobile robotics. Applications such as robots that guide blind or mentally handicapped people, robots t...
Design
Oriented filters are useful in many early vision and image processing tasks. One often needs to apply the same filter, rotated to different angles under adaptive control, or wishes to calculate the filter response at various orientations. We present an efficient architecture to synthesize filters of arbitrary orientations from linear combinations of basis filters, allowing one to adaptively &#034;steer&#034; a filter to any orientation, and to determine analytically the filter output as a function of orientation.
Reconstructing Strings from Substrings in Rounds.
We establish a variety of combinatorial bounds on the tradeoffs inherent in reconstructing strings using few rounds of a given number of substring queries per round. These results lead us to propose a new approach to sequencing by hybridization (SBH), which uses interaction to dramatically reduce the number of oligonucleotides used for de novo sequencing of large DNA fragments, while preserving the parallelism which is the primary advantage of SBH.  1 Introduction  Sequencing by hybridization (SBH) [4, 11] is a new and promising approach to DNA sequencing which offers the potential of reduced cost and higher throughput over traditional gel-based approaches. In this paper, we propose a new approach to sequencing by hybridization which permits the sequencing of arbitrarily large fragments without the inherently exponential chip area of SBH, while retaining the massive parallelism which is the primary advantage of the technique. We establish the potential of our technique through both ana...
Extending a parallel CLP language to support the development of multi%2Dagent systems.
An extension of the parallel constraint logic programming language ElipSys is presented. This extension is directed towards the development of multi-agent systems which have to deal with large combinatorial problems that are distributed in nature. Problems of this kind, after being decomposed into subproblems, may be tackled efficiently by individual agents using ElipSys&#039; powerful mechanisms, such as parallelism and constraint satisfaction techniques. The proposed extension supports the communication requirements of the agents, in order to have them cooperate and solve the original combinatorially intensive problem. The communication scheme among the agents is viewed as a three-layered model. The first layer is socket oriented, the second realizes a blackboard architecture and the third supports virtual point-topoint interaction among the agents.  Keywords  multi-agent systems, distributed execution, parallel CLP  Introduction  Multi-agent systems is a major research area of Distribute...
